A Lower Bound for Succinct Rank Queries
نویسنده
چکیده
The rank problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries of the form Rank(k) = ∑k i=1 A[i]. The problem has been intensely studied, and features as a subroutine in a majority of succinct data structures. We show that in the cell probe model with w-bit cells, if rank takes t time, the space of the data structure must be at least n+n/w bits. This redundancy/query trade-off is essentially optimal, matching our upper bound from [FOCS’08].
منابع مشابه
Optimal Trade-Offs for Succinct String Indexes
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of queries on s: select(c, j), returning the position in s containing the jth occurrence of c, and rank(c, p), counting how many occurrences of c are found in the f...
متن کاملA Framework for Dynamizing Succinct Data Structures
We present a framework to dynamize succinct data structures, to encourage their use over non-succinct versions in a wide variety of important application areas. Our framework can dynamize most stateof-the-art succinct data structures for dictionaries, ordinal trees, labeled trees, and text collections. Of particular note is its direct application to XML indexing structures that answer subpath q...
متن کاملSuccinct Approximate Rank Queries
We consider the problem of summarizing a multi set of elements in {1, 2, . . . , n} under the constraint that no element appears more than ` times. The goal is then to answer rank queries — given i ∈ {1, 2, . . . , n}, how many elements in the multi set are smaller than i? — with an additive error of at most ∆ and in constant time. For this problem, we prove a lower bound of B`,n,∆ , ⌊ n d∆/`e ...
متن کاملA Succinct, Dynamic Data Structure for Proximity Queries on Point Sets
A data structure is said to be succinct if it uses an amount of space that is close to the informationtheoretic lower bound, but still allows for efficient query processing. Quadtrees are among the most widely used data structures for answering queries on point sets in Euclidean space. In this paper we present a succinct quadtree structure. Our data structure can efficiently answer approximate ...
متن کاملCell probe lower bounds for succinct data structures
In this paper, we consider several static data structure problems in the deterministic cell probe model. We develop a new technique for proving lower bounds for succinct data structures, where the redundancy in the storage can be small compared to the informationtheoretic minimum. In fact, we succeed in matching (up to constant factors) the lower order terms of the existing data structures with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0907.1103 شماره
صفحات -
تاریخ انتشار 2009